New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures
نویسندگان
چکیده
Article history: Received 23 July 2011 Received in revised form 13 March 2013 Accepted 25 March 2013 Available online 2 April 2013
منابع مشابه
On the Information Rate of Secret Sharing Schemes
We derive new limitations on the information rate and the average information rate of secret sharing schemes for access structure represented by graphs. We give the rst proof of the existence of access structures with optimal information rate and optimal average information rate less that 1=2 + , where is an arbitrary positive constant. We also consider the problem of testing if one of these ac...
متن کاملNew General Lower Bounds on the Information Rate of Secret Sharing Schemes
We derive new limitations OIL the information rate and the average information rate of secret sharing schemes for access structure represented by graphs. We give the first proof of t he existcnce u l Access structures w i l h optimal information rate and optimal average information rate less that 1/2 + c, where E is an arbitrary positive constant. We also provide several general lower Luunds on...
متن کاملOn the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes
In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...
متن کاملOptimal Linear Secret Sharing Schemes for Graph Access Structures on Six Participants
We review the problem of finding the optimal information ratios of graph access structures on six participants. Study of such access structures were initiated by van Dijk [Des. Codes Cryptogr. 15 (1998), 301-321]. Through a sequence of follow up works, exact values of optimal information ratios of nine access structures, out of 18 initially unsolved non-isomorphic ones, were determined. Very re...
متن کاملA Study on the Average Information Ratio of Perfect Secret-Sharing Schemes for Access Structures Based On Bipartite Graphs
A perfect secret-sharing scheme is a method to distribute a secret among a set of participants in such a way that only qualified subsets of participants can recover the secret and the joint share of participants in any unqualified subset is statistically independent of the secret. The collection of all qualified subsets is called the access structure of the perfect secret-sharing scheme. In a g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Sci.
دوره 240 شماره
صفحات -
تاریخ انتشار 2013